Presbyopic branch target prefetch method and apparatus

ABSTRACT

An instruction prefetch apparatus includes a branch target buffer (BTB), a presbyopic target buffer (PTB) and a prefetch stream buffer (PSB). The BTB includes records that map branch addresses to branch target addresses, and the PTB includes records that map branch target addresses to subsequent branch target addresses. When a branch instruction is encountered, the BTB can predict the dynamically adjacent subsequent block entry location as the branch target address in the record that also includes the branch instruction address. The PTB can predict multiple subsequent blocks by mapping the branch target address to subsequent dynamic blocks. The PSB holds instructions prefetched from subsequent blocks predicted by the PTB.

This application is a continuation of U.S. patent application Ser. No.09/518,939, filed on Mar. 6, 2000 now U.S. Pat. No. 6,732,260, which isincorporated herein by reference.

FIELD

The present invention relates generally to microprocessors, and morespecifically to microprocessors employing branch target prediction andprefetch mechanisms.

BACKGROUND

Many modern microprocessors have large instruction pipelines thatfacilitate high speed operation. “Fetched” program instructions enterthe pipeline, undergo operations such as decoding and executing inintermediate stages of the pipeline, and are “retired” at the end of thepipeline. When the pipeline receives a valid instruction each clockcycle, the pipeline remains full and performance is good. When validinstructions are not received each cycle, the pipeline does not remainfull, and performance can suffer. For example, performance problems canresult from branch instructions in program code. If a branch instructionis encountered in the program and the processing branches to the targetaddress, a portion of the instruction pipeline may have to be flushed,resulting in a performance penalty.

Branch Target Buffers (BTB) have been devised to lessen the impact ofbranch instructions on pipeline efficiency. A discussion of BTBs can befound in: David A. Patterson & John L. Hennessy, Computer Architecture AQuantitative Approach 271-275 (2d ed. 1990). A typical BTB applicationis also shown in FIG. 1A. FIG. 1A shows BTB 10 coupled to instructionpointer (IP) 18, and processor pipeline 20. Also included in FIG. 1A arecache 30 and fetch buffer 32.

The location of the next instruction to be fetched is specified by IP18. As execution proceeds in sequential order in a program, IP 18increments each cycle. The output of IP 18 drives port 34 of cache 30and specifies the address from which the next instruction is to befetched. Cache 30 provides the instruction to fetch buffer 32, which inturn provides the instruction to processor pipeline 20. Fetch buffer 32typically has a latency associated therewith, herein referred to as“Icache latency.”

When instructions are received by pipeline 20, they proceed throughseveral stages shown as fetch stage 22, decode stage 24, intermediatestages 26, and retire stage 28. Information on whether a branchinstruction results in a taken branch is typically not available until alater pipeline stage, such as retire stage 28. When BTB 10 is notpresent and a branch is taken, fetch buffer 32 and the portion ofinstruction pipeline 20 following the branch instruction holdinstructions from the wrong execution path. The invalid instructions inprocessor pipeline 20 and fetch buffer 32 are flushed, and IP 18 iswritten with the branch target address. A performance penalty results,in part because the processor waits while fetch buffer 32 andinstruction pipeline 20 are filled with instructions starting at thebranch target address. The performance penalty is roughly equal to thesum of the Icache latency and the processor pipeline latency.

Branch target buffers lessen the performance impact of taken branches.BTB 10 includes records 11, each having a branch address (BA) field 12and a target address (TA) field 14. TA field 14 holds the branch targetaddress for the branch instruction located at the address specified bythe corresponding BA field 12. When a branch instruction is encounteredby processor pipeline 20, the BA fields 12 of records 11 are searchedfor a record matching the address of the branch instruction. If found,IP 18 is changed to the value of the TA field 14 corresponding to thefound BA field 12. As a result, instructions are next fetched startingat the branch target address. This mechanism is commonly referred to as“branch target prefetch.”

Branch target prefetch can occur while the branch instruction is stillearly in the processor pipeline, such as in decode stage 24. In thiscase, when the predicted branch is actually taken, the latency isreduced from the sum of the Icache latency and the processor pipelinelatency described above; however, the penalty associated with fetchbuffer 32 (Icache latency) remains.

The latency associated with the use of BTB 10 is shown in FIG. 1B. Inregion 60, the processor pipeline has filled, and performance is good.In region 70, a branch is taken, and the fetch buffer is flushed andrefilled. As shown in region 70, performance drops as the pipeline isflushed, and then performance is regained as the pipeline is refilled.Performance drops during latency period 50. Latency period 50 is afunction of the fetch buffer depth and the relative speeds of theprocessor pipeline and the cache. As the processor pipeline increases inspeed, latency period 50 increases when expressed as a number of cycles.

For the reasons stated above, and for other reasons stated below whichwill become apparent to those skilled in the art upon reading andunderstanding the present specification, there is a need in the art foran alternate method and apparatus for branch target prefetch.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a prior art branch target prefetch mechanism;

FIG. 1B shows prior art performance during a branch target prefetch;

FIG. 2 shows a processor including a presbyopic branch target prefetchmechanism;

FIG. 3 shows a software control flow graph;

FIG. 4A shows a branch target buffer and a presbyopic target buffer inaccordance with an embodiment of the invention;

FIG. 4B shows a branch target buffer and a presbyopic target buffer inaccordance with another embodiment of the invention;

FIG. 5 shows a prefetch stream buffer;

FIG. 6 shows a series of function calls and returns; and

FIG. 7 shows a return stack buffer and a presbyopic return stack buffer.

DESCRIPTION OF EMBODIMENTS

In the following detailed description of the embodiments, reference ismade to the accompanying drawings that show, by way of illustration,specific embodiments in which the invention may be practiced. In thedrawings, like numerals describe substantially similar componentsthroughout the several views. These embodiments are described insufficient detail to enable those skilled in the art to practice theinvention. Other embodiments may be utilized and structural, logical,and electrical changes may be made without departing from the scope ofthe present invention. Moreover, it is to be understood that the variousembodiments of the invention, although different, are not necessarilymutually exclusive. For example, a particular feature, structure, orcharacteristic described in one embodiment may be included within otherembodiments. The following detailed description is, therefore, not to betaken in a limiting sense, and the scope of the present invention isdefined only by the appended claims, along with the full scope ofequivalents to which such claims are entitled.

FIG. 2 shows a processor including a presbyopic branch target prefetchmechanism. Apparatus 200 includes branch target buffer (BTB) 205,presbyopic target buffer (PTB) 210, and cache memory 220. Apparatus 200also includes fetch buffer (FB) 32, target block prefetch stream buffer(PSB) 250, multiplexer 260, and processor pipeline 20. BTB 205 receivesbranch instruction addresses from processor pipeline 20 on node 202 andpredicts branch target addresses. Branch target addresses are providedto port 222 of cache 220, and processor instructions starting at thetarget address are provided to FB 32.

BTB 205 also provides the branch target address to PTB 210 on node 207.In some embodiments, PTB 210, unlike BTB 205, maps branch targetaddresses to subsequent branch target addresses. For example, whereasBTB 205 maps an exit IP from a block to an entrance IP of a subsequentblock, PTB 210 maps an entrance IP of a block to an entrance IP of asubsequent block. Embodiments of PTB 210 are described more fully withreference to FIGS. 4A and 4B below.

In some embodiments, PTB 210 can be recursively searched as shown bynode 209 in FIG. 2. Recursive searching in PTB 210 is also more fullyexplained below. PTB 210 provides the entrance IP of a subsequent blockto cache 220 on port 224. Instructions fetched from the subsequent blockentrance IP are provided to PSB 250. PSB 250 is a prefetch stream buffercapable of holding instructions prefetched as a result of the operationof PTB 210. In some embodiments, PSB 250 is at least as long as theIcache latency so that when FB 32 is flushed as a result of a branch,prefetched instructions can be provided from PSB 250 through multiplexor260.

PTB 210 operates as a “far-sighted” branch target buffer through thevarious mapping schemes and recursive searches employed. Branch targetsand subsequent blocks that dynamically reside multiple blocks in thefuture can be predicted by PTB 210, as is explained in more detailbelow. PTB 210 is referred to as “presbyopic” to reflect the far-sightednature of its operation, and to differentiate PTB 210 from BTB 205.

FIG. 3 shows a software control flow graph. Control flow graph 300 showsblocks 301, 310, 320, 330, 340, and 350, which represent software coderegions, or “blocks,” each including a block entrance instruction,intermediate instructions, and a block exit instruction. Each of theseinstructions occurs at a location specified at runtime as an IP value.For example, block 301 has an instruction labeled “a.in” at entrance IP302, has an instruction labeled “a.out” at exit IP 306, and hasintermediate instructions 304 therebetween. The entrance IP of eachblock can be a target address for a branch instruction. For example, inblock 301, when “a.out” is a branch instruction, “b.in” is the targetaddress of the branch instruction. In general, target addresses ofbranch instructions correspond to entrance IPs of subsequent blocks.

Blocks that occur later in the control flow are termed “subsequentblocks.” For example, blocks 310 and 320 are blocks subsequent to block301. Likewise, blocks 330, 340, and 350 are blocks subsequent to blocks301, 310, and 320. “Dynamically adjacent” subsequent blocks are blocksthat execute one after another. For example, blocks 320 and 330 aredynamically adjacent, but blocks 310 and 330 are not. Dynamicallyadjacent blocks are not necessarily physically adjacent in the programcode.

Blocks 320, 330, 340, and 350 form a “hammock.” A hammock occurs whenthe control flow can branch to different subsequent blocks, and thedifferent subsequent blocks return control to a common subsequent block.For example, in control flow graph 300, block 320 can branch to eitherblock 330 or block 340. In other words, the “c.out” instruction at exitIP 326 can have a target address that resolves to either entrance IP 332or entrance IP 342. When the target address resolves to entrance IP 332,control flow branches to block 330, and instructions beginning with“d.in” are executed. In contrast, when the target address resolves toentrance IP 342, control flow branches to block 340, and instructionsbeginning with “e.in” are executed.

The hammock is formed because both blocks 330 and 340 branch to block350. For example, in block 330, the “d.out” instruction at exit IP 336branches to the “f.in” instruction at entrance IP 352. Likewise, inblock 340, the “e.out” instruction at exit IP 346 also branches to the“f.in” instruction at entrance IP 352. Even if branch prediction fromblock 320 to either block 330 or 340 is unreliable, predicting block 350as a block subsequent to block 320 may be reliable as a result of thehammock.

As just described, hammocks can create a scenario where prediction maybe more reliable when predicted subsequent blocks are not dynamicallyadjacent, but are instead more than one dynamic block away.“Skip-adjacent” prediction can be used to reliably predict subsequentblocks more than one dynamic block away. FIG. 4A gives one example ofskip-adjacent prediction.

FIG. 4A shows a branch target buffer and a presbyopic target buffer inaccordance with an embodiment of the invention. Embodiment 400 includesbranch target buffer (BTB) 205, and presbyopic target buffer (PTB) 210.BTB 205 is an array that caches records 412. Each record 412 isorganized into fields which include branch address (BA) field 416,target address (TA) field 418, and confidence counter field (CC) 420. BAfield 416 holds the address of branch instructions, and TA field 418holds addresses of branch targets. For example, the first record shownin BTB 205 maps “a.out” to “b.in.” As shown in FIG. 3, “a.out” is abranch instruction at a block exit, and “b.in” is the first instructionat a subsequent block entrance.

BTB 205 receives the current instruction pointer on node 202 andperforms a search of BA field 416. If a matching record is found, thecurrent instruction pointer on node 202 points to a branch instructionand BTB 205 predicts the target address by sending the corresponding TAfield 418 value out on node 207. For example, when node 202 has theaddress of “b.out” impressed thereon, BTB 205 will drive node 207 withthe address of “c.in.”

BTB 205 also includes CC Field 420. In some embodiments, CC Field 420includes a saturating counter that counts the number of times the cachedbranch is taken. For example, in embodiment 400, CC Field 420 includes a3 bit saturating counter. Each time the cached branch is taken, thesaturating counter in CC Field 420 is incremented. When the counterreaches the maximum value, the counter remains at the maximum value andno longer increments. Each time the branch is not taken, the saturatingcounter decrements. If a saturating counter drops below zero, then theconfidence in the cached branched is eroded to the point that thecorresponding record is removed from BTB 205. In some embodiments, CCfield 420 is kept small, in part because BTB 205 can be on a criticalpath for instruction fetches. In embodiment 400, CC field 420 is shownas three bits wide. In this embodiment, eight consecutive non-takenbranches will cause a record be removed from BTB 205.

PTB 210 includes records that map a branch target address (or anentrance to a block) to a subsequent branch target address (or to anentrance to a subsequent dynamic block). PTB 210 includes target address(TA) fields 424 and 426. PTB 210 receives the current instructionpointer value on node 418 and performs a search for a record having amatching value in TA field 424. When found, the contents of TA field 426are driven on node 212. Node 212 can then be used to drive a cache port,such as cache port 224 (FIG. 2).

PTB searches and predictions can occur in the same clock cycle as theBTB search, or can be deferred to subsequent clock cycles. In addition,PTB lookup and prediction can be performed either upon the BTB lookup atthe fetch stage in the front end of pipeline 20 (FIG. 2), or after thebranch target address is actually resolved at the end of the pipeline.

PTB 210 can also perform recursive searches. A recursive search isperformed when PTB 210 drives node 209 with a target address from TAfield 426, and searches TA field 424. In this manner, PTB 210 canpredict multiple subsequent dynamic blocks. For example, when blockentrance IP 302 (FIG. 3) appears as an input to PTB 210 on node 418, PTB210 matches the first record and drives node 209 with entrance IP 312,which is the address of the instruction “b.in.” PTB 210 receives this,performs a search, and finds a record that maps “b.in” to “c.in,” anddrives the address of “c.in” on node 209. PTB 210 can then recursivelysearch based on the address on node 209.

Searches can also include BTB 205 and PTB 210 in combination. When abranch instruction is pointed to by the current IP on node 202, BTB 205will drive the corresponding target address (if a matching record isfound) on node 207. PTB 210 receives the target address on node 207 andcan use it to perform a search for a subsequent dynamic block. Forexample, if the location of “b.out” is on node 202, BTB 205 will drivenode 207 with the location of “c.in.” PTB 210 receives the location of“c.in” on node 207, finds a matching record, and drives nodes 212 and209 with the location of “f.in.” At this point, a further recursivesearch can take place.

Recursive searches of PTB 210, and searches utilizing both BTB 205 andPTB 210 result in “domino prediction.” Domino prediction occurs whenmultiple subsequent dynamic blocks are predicted. PTB 210 can performdomino prediction off the critical path, and can cause the prefetch ofinstructions from subsequent blocks more than one dynamic block away.Referring now to FIG. 2, PTB 210 is shown driving port 224 of cache 220.Cache 220 sends prefetched instructions to PSB 250. When performingdomino prediction, PSB 250 can include instructions prefetched frommultiple predicted subsequent dynamic blocks. PSB 250 can include all ofthe instructions from a predicted block, or can include a subset of thepredicted block.

Some embodiments support multi-way domino prediction. For branches thatare likely to frequently take multiple dynamic targets, multiple targetbasic blocks can be captured via associating a single BTB record withmultiple PTB records. In some embodiments, BTB 205 and PTB 210 includeindex fields for the association, and in other embodiments, multiplePTBs are implemented.

PTB 210 also includes confidence counter (CC) field 428. CC field 428operates in a manner similar to that of CC field 420 of BTB 205. Eachtime a predicted branch is actually taken, the corresponding CC field428 is incremented unless saturated, and each time the predicted branchis not taken, CC field 428 is decremented. In some embodiments, theconfidence counter of PTB 210 is larger than confidence counters used inBTB 215. Because PTB 210 performs subsequent block prediction well inadvance of the actual execution of the predicted subsequent block, PTB210 is not on the critical path. More time can be taken to increment anddecrement confidence counters, and so CC field 428 can be large. A largeCC field 428 in PTB 210 can increase the accuracy of subsequent dynamicblock prediction.

PTB 210 can also perform skip-adjacent prediction. Record 434 within PTB210 is an example of a PTB record that performs skip-adjacentprediction. Record 434 maps the location of instruction “c.in” to thelocation of instruction “f.in.” This corresponds to mapping entrance IP322 of block 320 to entrance IP 352 of block 350 (FIG. 3). When thisprediction occurs, PSB 250 can include instructions from block 320 (“a”instructions) and instructions from block 350 (“f” instructions) withoutincluding any instructions from either block 330 or 340 (“d” or “e”instructions). This is an example of skip-adjacent prediction becauseblocks dynamically adjacent to block 320 are skipped in favor of asubsequent block occurring later in the control flow.

When BTB 205 is searched, and a matching record is found, the current IPspecifies the location of a branch instruction. If BTB 205 and PTB 210are populated with records that correctly predict the branches taken onthe current control flow, the instruction located at the predictedtarget address and its subsequent instructions are likely already in PSB250 (FIG. 2), because this current branch has likely been predictedpreviously as a domino prediction.

In some embodiments, BTB 205 and PTB 210 share a single target addressarray. For example, BTB 205 includes a record that maps “b.out” to“c.in,” and PTB 210 includes a record that maps “b.in” to “c.in.” The“c.in” target field value is common to both BTB 205 and PTB, and can beshared.

In some embodiments, domino prediction is performed in a “disjointeager” fashion, in which a confidence gauge is associated with eachbranch prediction made speculatively along a dynamic path. Aspredictions are made further along the path, the confidence of theprediction degrades. As prediction confidence degrades, multiplealternative targets can be fetched instead of choosing a single path.When disjoint eager domino prediction is performed, instructions can beprefetched into PSB 250 (FIG. 2) from multiple disjoint paths.

TA fields 424 and 426 can includes the total number of bits needed tounambiguously specify an address, or can include a lesser number. Forexample, in a processor that specifies addresses using 32 bits, TAfields 424 and 426 may be 32 bits wide or less than 32 bits wide. Using32 bits will unambiguously specify the address, but will also take upstorage space. In some embodiments, TA fields 424 and 426 include fewerthan the total number of bits, and introduce a small amount of ambiguityin exchange for reduced size.

When fewer than the total number of bits is used, a matching record maycorrespond to a branch instruction that is aliased to the current IPvalue. For example, an instruction that is not at a block entry or ablock exit may cause a match in PTB 210 if the subset of bits used tospecify TA field 424 matches. In some embodiments, an additionalpipeline stage in pipeline 20 (FIG. 2) is used to check for a fulladdress match to check for this condition.

BTB 205 and PTB 210 are populated with records as branches areencountered during the execution of the software. When a new branch istaken, a new record is entered in BTB 205, and the branch address andtarget address are filled in. For each branch IP installed in BTB 205,the target address is also installed in a new record in PTB 210. In someembodiments, a parentheses matching state machine is employed to capturethe entrance IP of a block before the exit IP of the same block isinstalled in BTB 205. When the BTB record is installed, thecorresponding PTB record can also be installed. For example, aparentheses matching state machine can record the location of “a.in”when it is encountered, and leave the parentheses “open.” When “a.out”is encountered, and control branches to “b.in,” the state machine“closes” the parentheses, and the PTB record that maps “a.in” to “b.in”can be installed at the same time as the BTB record that maps “a.out” to“b.in.” If an exception occurs when the parentheses matching statemachine is “open,” the PTB record may never be installed. In this case,a BTB record will exist without a corresponding PTB record.

FIG. 4B shows a branch target buffer and a presbyopic target buffer inaccordance with another embodiment of the invention. Embodiment 440includes BTB 205 and PTB 450. BTB 205 accepts the current IP value onnode 202, and also accepts a branch address from PTB 450 on node 460. Inembodiment 440, PTB 450 has records that map target addresses (TA) 452to branch addresses (BA) 454. TA 452 and BA 454 correspond to entranceIPs and exit IPs of blocks.

As shown in FIG. 4B, PTB 450 maps block entrance IPs to block exit IPs.For example, the first record in PTB 450 maps the location ofinstruction “b.in” to the location of instruction “b.out.” In embodiment440, the combination of BTB 205 and PTB 450 can be recursively searched.For example, when node 202 has the location of instruction “b.out”impressed thereon, BTB 205 finds a matching record, and drives node 423with the location of instruction “c.in.” PTB 450 performs a search of TAfields 452, finds a matching record, and drives node 460 with thelocation of instruction “c.out.” This process can continue to predictmultiple subsequent dynamic blocks.

FIG. 5 shows a prefetch stream buffer. Prefetch stream buffer (PSB) 250includes instructions fetched as a result of subsequent blocks predictedby the action of a presbyopic target buffer, such as PTB 210 (FIG. 2).Each record in PSB 250 includes an instruction 510 and a coloring field520. Instruction field 510 holds prefetched instructions, and coloringfield 520 serves to demarcate boundaries between blocks of instructionsincluded within PSB 250. For example, entries 522 correspond to block“a,” shown in FIG. 3 as block 301. Entries 522 are shown having a valueof “a” in field 520, thereby signifying entries 522 having instructionsfrom block 301. Likewise, entries 524 have coloring field 520 values of“b,” entries 526 have coloring field 520 values of “c,” and entries 528have coloring field 520 values of “f.” Each of these values correspondsto a different block in control flow graph 300 (FIG. 3).

In some embodiments, coloring fields 520 are assigned a sequentiallyallocated unique number for each block that is predicted and prefetchedinto PSB 250. The value of the block color can be produced with a shiftregister, with the least significant bit representing the prediction ofthe latest branch. In this manner, the color value assigned to coloringfield 520 is similar to a fragment of global history. In someembodiments, a cache or other memory structure is employed to save pastcolor history, and the characteristic signature branch IP is used toretrieve past color history to hint or guide future domino predictions.This can be used to bound the depth of domino prediction.

In some embodiments, coloring field 520 is represented by a finitenumber of bits, such that each possible field value represents adifferent block. If a branch is mispredicted, coloring field 520 can beused to flush or invalidate instructions on the mispredicted path. Forexample, if PSB 250 included instructions for block “e,” and block “d”was traversed instead, the instructions for block “e” could beidentified within PSB 250 and flushed.

When disjoint eager prediction is performed, coloring field 520 can beassigned values such that mutually exclusive disjoint eagerly predictedand prefetched blocks are identified as such. As branch targets areresolved, blocks dependent on predicates compatible with the conditionalcode of the mispredicted branch can be flushed from PSB 250.

In some embodiments, PSB 250 is at least as long as FB 32 (FIG. 2),referred to as the Icache latency. When branch prediction by PTB 210 iscorrect, and PSB 250 has at least enough prefetched instructions toovercome the Icache latency, performance improves over a system with abranch target buffer alone. In embodiments capable of domino prediction,PSB 250 can be large enough to hold instructions from multiplesubsequent dynamic blocks. In some embodiments, all of the instructionsfrom the predicted blocks are prefetched, and in other embodiments, justenough instructions are prefetched from each predicted subsequentdynamic block to overcome the Icache latency.

FIG. 6 shows a series of functions calls and returns. Embodiment 600includes software functions 610, 620, and 630. Instructions withinsoftware function 610 are prefixed with the letter “a,” instructionswithin software function 620 are prefixed with the letter “b,” andinstructions within software function 630 are prefixed with the letter“c.” In the control flow shown in FIG. 6, function 610 starts at theinstruction “a.in,” and continues until reaching instruction “a.call,”which calls software function 620. The next instruction executed is“b.in,” and execution continues in software function 620 until reachinginstruction “b.call,” which calls software function 630. Softwarefunction 630 executes from instruction “c.in” to instruction “c.ret.”Instruction “c.ret” is a “return” instruction that causes execution tobranch back to the calling point. As a result of the return instruction,execution branches from instruction “c.ret” to instruction “b.call+1,”which is one instruction location away from instruction “b.call.”Software function 620 returns in the same manner when execution branchesfrom instruction “b.ret” to instruction “a.call+1.”

In some embodiments, function returns, such as those caused byinstructions “c.ret” and “b.ret,” can be predicted in a manner similarto branch prediction described with reference to the preceding figures.For example, return instructions can be treated as block exits, andinstructions occurring after call instructions can be treated as blockentrances. One such embodiment is now explained with reference to FIG.7.

FIG. 7 shows a return stack buffer and a presbyopic return stack buffer.Embodiment 700 shows return stack buffer (RSB) 710 and presbyopic returnstack buffer (PRSB) 720. RSB 710 operates in a manner similar to BTB 205(FIG. 4A). Each of records 712 includes a branch address (BA) field 714and a target address (TA) field 716. Within RSB 710, BA field 714 holdsthe address of return instructions, and TA field 716 holds the addressof instructions dynamically following the return instructions. Forexample, the first record of RSB 710 caches the address of instruction“b.call+1” as the address predicted to follow the address of instruction“c.ret.”

PRSB 720 includes records that map target addresses to target addresses.For example, the record shown in PRSB 720 predicts instruction“a.call+1” to follow instruction “b.call+1.” RSB 710 and PRSB 720 can beutilized together in a manner similar to embodiments 400 (FIG. 4A) and440 (FIG. 4B) to predict blocks subsequent to a function return.

RSB 710 and PRSB 720 have been described with reference to functioncalls and returns, but are also applicable to jump target tables. Thecombination of RSB 710 and PRSB 720 can be used to map the entrance IPof a block to the jump target of the block, such that instructions atthe next target block can be prefetched upon entrance into the currentblock that is ended by a jump.

It is to be understood that the above description is intended to beillustrative, and not restrictive. Many other embodiments will beapparent to those of skill in the art upon reading and understanding theabove description. The scope of the invention should, therefore, bedetermined with reference to the appended claims, along with the fullscope of equivalents to which such claims are entitled.

1. A processor comprising: a processor pipeline to output branchinstruction addresses; a branch target buffer responsive to the branchinstruction addresses, wherein the branch target buffer comprises branchtarget buffer records to map branch instruction addresses to branchtarget addresses associated with an entry location of a first coderegion, wherein the branch target buffer records comprise confidencecounters to track a number of times branches associated with the branchtarget addresses are taken; and a presbyopic target buffer responsive tothe branch target buffer, wherein the presbyopic target buffer comprisespresbyopic target buffer records to map the entry location of the firstcode region to an entry location of a second code region; a cache memoryto retrieve the instructions at the branch target addresses and theinstructions at the subsequent branch target addresses; a fetch bufferto receive the instructions at the branch target addresses; a prefetchstream buffer to receive the instructions at the subsequent branchtarget addresses.
 2. The processor of claim 1 wherein the presbyopictarget buffer is configured to be recursively searched to predict aplurality of subsequent branch target addresses.
 3. The processor ofclaim 1 wherein the presbyopic target buffer implements skip-adjacentmapping.
 4. The processor of claim 1 wherein a complete branch targetaddress is specified by a fixed number of bits, and the presbyopictarget buffer includes mapping records that specify branch targetaddresses using less than the fixed number of bits.
 5. The processor ofclaim 1, wherein the presbyopic target buffer records compriseconfidence counters to track a number of times branches associated withthe subsequent branch target addresses are taken.
 6. A methodcomprising: processing instructions in a processor pipeline, wherein theprocessing is to output branch instruction addresses in a branch targetbuffer that maps the branch instruction addresses to block entryaddresses associated with entry locations of first code regions,searching for a branch target buffer record having a branch instructionaddress that matches a current instruction address; after the branchtarget buffer record is found, incrementing a confidence counter in thebranch target buffer record and searching a presbyopic target bufferthat maps entry locations of the first code region to entry locations ofa second code region for a presbyopic target buffer record having ablock entry address matching the branch target buffer record; and afterthe presbyopic target buffer record is found, incrementing a confidencecounter in the presbyopic target buffer record and prefetchinginstructions beginning at the entry location of the second code regionincluded in the presbyopic target buffer record.
 7. The method of claim6 wherein prefetching comprises entering instructions into a streambuffer, the stream buffer having a coloring field for each instructionentered.
 8. The method of claim 6 further comprising: searching thepresbyopic target buffer recursively; and for each matching record foundin the presbyopic target buffer, each matching record having acorresponding subsequent block entry address, prefetching instructionsfrom each of the corresponding subsequent block entry addresses.
 9. Themethod of claim 8 wherein prefetching comprises: entering instructionsinto a stream buffer, the stream buffer having a coloring field for eachinstruction entered; and assigning a different color to instructionsfetched from different subsequent block entry addresses.
 10. The methodof claim 9 wherein each recursive search represents a predicted branch,the method further comprising flushing from the stream bufferinstructions prefetched as a result of a mispredicted branch.